On the Covering Radius of Codes over Z4 with Chinese Euclidean Weight
نویسندگان
چکیده
In this paper, we give lower and upper bounds on the covering radius of codes over the ring Z4 with respect to chinese euclidean distance. We also determine the covering radius of various Repetition codes, Simplex codes Type α and Type β and give bounds on the covering radius for MacDonald codes of both types over Z4.
منابع مشابه
On the covering radius of some modular codes
This paper gives lower and upper bounds on the covering radius of codes over Z2s with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type α and Type β) and their dual and give bounds on the covering radii for MacDonald codes of both types over Z4.
متن کاملHermitian Self-Dual Cyclic Codes of Length $p^a$ over $GR(p^2, s)$
In this paper, we study cyclic codes over the Galois ring GR(p, s). The main result is the characterization and enumeration of Hermitian self-dual cyclic codes of length pa over GR(p, s). Combining with some known results and the standard Discrete Fourier Transform decomposition, we arrive at the characterization and enumeration of Euclidean self-dual cyclic codes of any length over GR(p, s). S...
متن کاملOn Type IV self-dual codes over Z4
Recently, Type IV self-dual codes over rings of order 4 have been introduced as self-dual codes over the rings with the property that all Hamming weights are even. All Type IV self-dual codes over Z4 of lengths up to 16 are known. In this paper, the classi3cation of such codes of length 20 is given. The highest minimum Hamming, Lee and Euclidean weights of Type IV Z4-codes of lengths up to 40 a...
متن کاملOptimal self-dual Z4-codes and a unimodular lattice in dimension 41
For lengths up to 47 except 37, we determine the largest minimum Euclidean weight among all Type I Z4-codes of that length. We also give the first example of an optimal odd unimodular lattice in dimension 41 explicitly, which is constructed from some Type I Z4-code of length 41.
متن کاملSkew constacyclic codes over Galois rings
We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic self-dual codes over GR(4) are constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015